Vlsi Algorithms for Finding a Fundamental Set of Cycles and a Fundamental Set of Cutsets of a Graph
نویسنده
چکیده
We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fundamental set of cycles of an undirected graph yields an O(n 2) algorithm for generating shortest paths between all pairs of vertices of a graph on the same model.
منابع مشابه
VLSI Algorithms for Finding a Fundamental Set of Cycles and aFundamental Set of
We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...
متن کاملParallel Algorithms for Finding Cycles and Cutsets of Graphs
We rst present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding ...
متن کاملالگوریتم ژنتیک با جهش آشوبی هوشمند و ترکیب چندنقطهای مکاشفهای برای حل مسئله رنگآمیزی گراف
Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. Graph coloring problem (GCP) is about finding the smallest number of colors needed to color a given graph. The smallest number of colors needed to color a graph G, is called its chromatic number. GCP is a well-known NP-hard problems and, therefore, heuristic algorithms are usually...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کامل